On the query complexity of counterfeiting quantum money

Quantum money is a quantum cryptographic protocol in which a mint can produce a state (called a quantum bill) which anyone can verify but no one can copy. The only published protocol (quantum money from knots) implements a protocol for collision-free money that is defined in terms of a classical oracle. I give a reduction from a hard classical problem to a restricted type of attack against the general collision-free money protocol.